#include"BSTree.h"
int main() {
	int arr[10] = { 1,3,5,7,9,2,4,6,8,10 };
	BSTree<int> b;
	for (auto& e : arr) {
		b.insert(e);
	}
	b.InOder();


	for (int i = 0; i < (sizeof(arr) / sizeof(arr[0])); i++) {
		b.erase_R(arr[i]);
		b.InOder();
	}
	cout << endl;

	return 0;
}